A fast algorithm for evaluating nth order tri-diagonal determinants
نویسندگان
چکیده
منابع مشابه
A fast and reliable algorithm for evaluating nth order pentadiagonal determinants
In the current article we present a fast and reliable algorithm for evaluating nth order pentadiagonal determinants in linear time. It is a natural generalization of the DETGTRI algorithm [M. El-Mikkawy, A fast algorithm for evaluating nth order tri-diagonal determinants, J. Comput. Appl. Math. 166 (2004) 581–584]. The algorithm is suited for implementation using computer algebra systems (CAS) ...
متن کاملA computational algorithm for special nth-order pentadiagonal Toeplitz determinants
In this short note, we present a fast and reliable algorithm for evaluating special nth-order pentadiagonal Toeplitz determinants in linear time. The algorithm is suited for implementation using Computer Algebra Systems (CAS) such as MACSYMA and MAPLE. Two illustrative examples are given. 2007 Elsevier Inc. All rights reserved.
متن کاملFast Algorithm for Enumerating Diagonal Latin Squares of Small Order
In this paper we propose an algorithm for enumerating diagonal Latin squares of small order. It relies on specific properties of diagonal Latin squares to employ symmetry breaking techniques, and on several heuristic optimizations and bit arithmetic techniques to make use of computational power of stateof-the-art CPUs. Using this approach we enumerated diagonal Latin squares of order at most 9,...
متن کاملAd-755 137 a Fast Method for Solving a Class of Tri-diagonal Linear Systems
The solution of linear systems having real, symmetric, diagonally dominant, tridiagonal coefficient matrices with constant diagonals is considered. It is proved that the diagonals of the LU deccraposition of the coefficient matrix rapidly converge to full floating-point precision. It is also proved that the computed LU decomposition converges when floating-point arithmetic is used and that the ...
متن کاملThe Diagonal Reduction Algorithm Using Fast Givens
Recently, a new lattice basis reduction notion, called diagonal reduction, was proposed for lattice-reduction-aided detection (LRAD) of multiinput multioutput (MIMO) systems. In this paper, we improve the efficiency of the diagonal reduction algorithm by employing the fast Givens transformations. The technique of the fast Givens is applicable to a family of LLL-type lattice reduction methods to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2004
ISSN: 0377-0427
DOI: 10.1016/j.cam.2003.08.044